Adaptive Simplex Architecture for Safe, Real-Time Robot Path Planning
نویسندگان
چکیده
منابع مشابه
Real-Time Path Planning for Humanoid Robot Navigation
We present a data structure and an algorithm for real-time path planning of a humanoid robot. Due to the many degrees of freedom, the robots shape and available actions are approximated for finding solutions efficiently. The resulting 3 dimensional configuration space is searched by the A* algorithm finding solutions in tenths of a second on lowperformance, embedded hardware. Experimental resul...
متن کاملReal-time randomized path planning for robot navigation
Mobile robots often find themselves in a situation where they must find a trajectory to another position in their environment, subject to constraints posed by obstacles and the capabilities of the robot itself. This is the problem of planning a path through a continuous domain, for which several approaches have been developed. Each has some limitations however, including requiring state discret...
متن کاملA Hardware Architecture for Robot Path Planning
Robot paths can be planned in quantized configuration spaces. Each configuration represents an unique location of the robot. If a matrix of prohibited and permitted transitions is available, paths can be found in the configuration space by heuristic search algorithms. We have studied algorithms and architectures for finding these paths. We propose a hardware architecture that uses an implementa...
متن کاملReal-time Path Planning Tracing of Deformable Object by Robot
Edge tracing is considered important for deformable object manipulation in order to spread and reveal the original shape of an object before it can be sorted. This paper proposes a unique real-time path-planning tracing method for clothes manipulation by robots. Tracing in this paper context involves tracing the clothes edge, with the robot arm movement based on the calculated path and feedback...
متن کاملPlanning, Fast and Slow: A Framework for Adaptive Real-Time Safe Trajectory Planning
Motion planning is an extremely well-studied problem in the robotics community, yet existing work largely falls into one of two categories: computationally efficient but with few if any safety guarantees, or able to give stronger guarantees but at high computational cost. This work builds on a recent development called FaSTrack in which a slow offline computation provides a modular safety guara...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sensors
سال: 2021
ISSN: 1424-8220
DOI: 10.3390/s21082589